Abstract versus concrete computation on metric partial algebras
نویسندگان
چکیده
منابع مشابه
Concrete Models of Computation for Topological Algebras
A concrete model of computation for a topological algebra is based on a representation of the algebra made from functions on the natural numbers. The functions computable in a concrete model are computable in the representation in the classical sense of the Chruch-Turing Thesis. Moreover, the functions turn out to be continuous in the topology of the algebra. In this paper we consider different...
متن کاملAbstract Versus Concrete Temporal Query Languages
Versus Concrete Temporal Query Languages Jan Chomicki, University at Buffalo, USA, http://www.cse.buffalo.edu/~chomicki David Toman, University of Waterloo, Canada, http://www.cs.uwaterloo.ca/~david SYNONYMS historical query languages DEFINITION Temporal query languages are a family of query languages designed to query (and access in general) time-dependent information stored in temporal databa...
متن کاملAbstract structure of partial function $*$-algebras over semi-direct product of locally compact groups
This article presents a unified approach to the abstract notions of partial convolution and involution in $L^p$-function spaces over semi-direct product of locally compact groups. Let $H$ and $K$ be locally compact groups and $tau:Hto Aut(K)$ be a continuous homomorphism. Let $G_tau=Hltimes_tau K$ be the semi-direct product of $H$ and $K$ with respect to $tau$. We define left and right $tau$-c...
متن کاملConcrete Results on Abstract Rules
There are many different notions of “rule” in the literature. A key feature and main intuition of any such notion is that rules can be “applied” to derive conclusions from certain premises. More formally, a rule is viewed as a function that, when invoked on a set of known facts, can produce new facts. In this paper, we show that this extreme simplification is still sufficient to obtain a number...
متن کاملA Network Model of Analogue Computation over Metric Algebras
We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continuous clock T. The inputs and outputs of the network are continuous streams u : T → A, and the input-output behaviour of the network with system parameters from A is modelled by a function Φ : C[T, A]×Ar → C[T, A] (p, q > 0, r ≥ 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2004
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1024922.1024924